Dynamic Quantized Consensus of General Linear Multiagent Systems Under Denial-of-Service Attacks

In this article, we study multiagent consensus problems under Denial-of-Service (DoS) attacks with data rate constraints. We first consider the leaderless problem and after that briefly present analysis of leader–follower consensus. The dynamics agents take general forms modeled as homogeneous linear time-invariant systems. our analysis, derive lower bounds on for systems to achieve in presence DoS attacks, which issue overflow quantizer is prevented. main contribution article characterization tradeoff between tolerable attack levels required rates quantizers during communication attempts among agents. To mitigate influence employ dynamic quantization zooming-in zooming-out capabilities avoiding saturation.